Complexity of deciding bisimilarity of nBPP and bisimilarity of BPP with finite-state system
نویسنده
چکیده
Jančar has recently shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space (presented at LiCS 2003). In this paper are summarized two results which use general techniques from Jančar’s paper. First result by Kot and Jančar (presented at AVIS 2004) shows that bisimilarity on normed basic parallel processes can be decided in O(n). The second result by Kot and Sawa (submitted to Infinity 2004) shows that bisimilarity of given BPP and finite-state system can be decided in polynomial time, concretely in O(n).
منابع مشابه
Computational Complexity of Some Equivalence-Checking Problems
This habilitation thesis gives an overview of five papers of the author in the area of verification, in particular, in the study of computational complexity of equivalence checking problems and related areas. The first of these papers, Sawa, Jančar: Equivalences on Finite-State Systems are PTIME-hard (2005), shows that deciding any relation between bisimulation equivalence (bisimilarity) and tr...
متن کاملBranching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP. The algorithm for BPA improves a previous one given by Kučera and Mayr, while the one for normed BPP demonstrates the polynomial-time decidability of the problem, which is unknown previously. The proof style follows a...
متن کاملBisimilarity on normed Basic Parallel Processes can be decided in time O ( n 3 )
A recent paper by Jančar (presented at LiCS 2003) demonstrated that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. Here we explore a (more detailed) version of the respective algorithm when applied to the subclass called normed BPP (nBPP), and show that in this case the algorithm runs in polynomial time; we provide a complexity analysis yielding the upper bou...
متن کاملNormed BPA vs. Normed BPP Revisited
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process. This improves the previously known exponential upper bound by Černá, Křet́ınský, Kučera (1999). The algorithm relies on a polynomial bound for the “finite-state core” of the transition system generated by the BPP process. The bound is derived from the “prime form” of the underlying...
متن کاملComplexity of some Bisimilarity Problems between BPP and BPA or Finite-State System
I present my research concerning complexity of bisimilarity between BPP and other simple process rewrite systems, specifically BPA and finite-state systems. The results are based on some general notions introduced by Jančar in [1] where he has shown PSPACE-completeness of bisimilarity on BPP. Some of presented results are joint work with Zdeněk Sawa or my supervisor Petr Jančar.
متن کامل